GPU Optimized Marching Cubes Algorithm for Handling Very Large, Temporal Datasets
نویسنده
چکیده
In this article is presented an efficient implementation of the Marching Cubes Algorithm using nVidia’s CUDA technology, which can handle datasets that are so large that they cannot be loaded into the working memory of the used computer. Two kinds of data are considered: a single 3D grid that is too large to fit in memory and many, temporal 3D grids that individually fit in memory, but combined do not. The presented implementation makes use of the facilities in a software framework for exploring data called DXTK, which is also briefly presented, and the Marching Cubes algorithm is implemented as a module
منابع مشابه
Real-Time Surface Extraction and Visualization of Medical Images using OpenCL and GPUs
Marching Cubes (MC) is an algorithm that extracts surfaces from volumetric scalar data. It is used extensively in visualization and analysis of medical data from modalities like CT and MR, usually after a 3D segmentation of the structures of interest have been performed. Implementations of MC on CPUs are slow, using several seconds (even minutes) to extract the surface before sending it to the ...
متن کاملReal-Time Marching Cubes on the Vertex Shader
In this paper we propose a new approach for visualizing volumetric datasets by their isosurfaces. For an interactive isosurface reconstruction an optimized version of the well-known marching cubes algorithm is used. We extend the original algorithm by an additional vertex shader program. Contrary to other hardware-accelerated solutions our program is not based on a tetrahedral algorithm and thu...
متن کاملHistoPyramids in Iso-Surface Extraction
We present an implementation approach to high-speed Marching Cubes, running entirely on the Graphics Processing Unit of Shader Model 3.0 and 4.0 graphics hardware. Our approach is based on the interpretation of Marching Cubes as a stream compaction and expansion process, and is implemented using the HistoPyramid, a hierarchical data structure previously only used in GPU data compaction. We exte...
متن کاملA Vector-parallel Realization of the Marching Cubes
The Marching Cubes algorithm is a popular high-resolution isosurface extraction method used in volume data visualization. However, it is relatively computationally intensive making real-time operation on normal workstations a diicult goal when applied to large datasets. One solution is to transform the serial algorithm into a vector-parallel algorithm designed to exploit the potential computing...
متن کاملAdaptive cube tessellation for topologically correct isosurfaces
Three dimensional datasets representing scalar fields are frequently rendered using isosurfaces. For datasets arranged as a cubic lattice, the marching cubes algorithm is the most used isosurface extraction method. However, the marching cubes algorithm produces some ambiguities which have been solved using different approaches that normally imply a more complex process. One of them is to tessel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008